Generating College Conference Basketball Schedules by a SAT Solver

نویسنده

  • Hantao Zhang
چکیده

Major college conferences basketball matches draw millions of viewers each year. Besides team members care about the fairness of a schedule, there are also loyal fans and die-hard team followers who are upset with inconvenient shceduling, not to mention leaders of other sports, such as swimming and wresting, who have to schedule around basketball games. For instance, sportscasters might mention that that Ohio State had a tough schedule in 2002, because after playing five out of six conference games at home, they had to play four road games in a row. For a schedule to be fair, we may require that no teams play three consecutive home games or three consecutive road games. According to this criterion, several BigTen schools do not have a fair schedule in 2002 [10].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SAT Based Scheduler for Tournament Schedules

We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. The search engine inside the scheduler is a SAT solver which can handle a mix of ordinary and TL (True-Literal) clauses. The latter are the formulas using the function TL which counts the number of true literals in a c...

متن کامل

Scheduling A Major College Basketball Conference

The nine universities in the Atlantic Coast Conference (ACC) have a basketball competition in which each school plays home and away games against each other over a nine-week period. The creation of a suitable schedule is a very di cult problem with a myriad of con icting requirements and preferences. We develop an approach to scheduling problems that uses a combination of integer programming an...

متن کامل

Parallel SAT Solver Selection and Scheduling

Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the paralle...

متن کامل

Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction

Sequential algorithm portfolios for satisfiability testing (SAT), such as SATzilla and 3S, have enjoyed much success in the last decade. By leveraging the differing strengths of individual SAT solvers, portfolios employing older solvers have often fared as well or better than newly designed ones, in several categories of the annual SAT Competitions and Races. We propose two simple yet powerful ...

متن کامل

Guest Editors Conclusion

This special issue comprises six papers devoted to SAT solving and three papers devoted to MAXSAT solving. With two exception, the papers contain detailed information about some of the best solvers from the 5th SAT solver competition and from the 2nd MAX-SAT solver competition, which took place as side event of the 10th International Conference on Theory and Applications of Satisfiability Testi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002